n,m,Sx,Sy=map(int,input().split())
print(Sx,Sy)
for j in range(m):
if j!=Sy-1:
print(Sx,j+1)
for j in range(m-1,-1,-1):
if j%2==0:
for i in range(n):
if i!=Sx-1:
print(i+1,j+1)
else:
for i in range(n-1,-1,-1):
if i!=Sx-1:
print(i+1,j+1)#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <math.h>
#include <set>
#include <numeric>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD ll(1e9 + 7)
void solve() {
int n, m, x, y;
cin >> n >> m >> x >> y;
int lastY = 0;
for (int i = 0; i < n; i++) {
int xx = (((x - 1 + i) % n) + 1);
for (int j = 0; j < m; j++) {
lastY = ((y - 1 + j) % m) + 1;
cout << xx << " " << lastY << "\n";
}
y = lastY;
}
}
int main() {
solve();
//cout << solve();
//int t;
//cin >> t;
//while (t--) {
// /*solve();
// cout << "\n";*/
// cout << solve() << "\n";
//}
}
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |